AEON: Synthesizing Scheduling Algorithms from High-Level Models
نویسندگان
چکیده
This paper describes the AEON system whose aim is to synthesize scheduling algorithms from high-level models. AEON, which is entirely written in COMET, receives as input a high-level model for a scheduling application which is then analyzed to generate a dedicated scheduling algorithm exploiting the structure of the model. AEON provides a variety of synthesizers for generating complete or heuristic algorithms. Moreover, synthesizers are compositional, making it possible to generate complex hybrid algorithms naturally. Preliminary experimental results indicate that this approach may be competitive with state-of-the-art search algorithms.
منابع مشابه
Solving scheduling problems from high-level models
of the Thesis Scheduling consists in deciding when a set of activities must be executed under different constraints, in order to optimize a given objective. The two main types of constraints are precedences between activities, and the availability of finite resources. Common objectives are to minimize the total duration, or to minimize the weighted sum of the tardiness of activities with respec...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملProject resource investment problem under progress payment model
As a general branch of project scheduling problems, resource investment problem (RIP) considers resource availabilities as decision variables to determine a level of employed resources minimizing the costs of the project. In addition to costs (cash outflows), researchers in the later extensions of the RIP took payments (cash inflows) received from clients into account and used the net present v...
متن کاملResource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)
Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...
متن کاملStaff Scheduling by a Genetic Algorithm
This paper describes a Genetic Algorithms approach to amanpower-scheduling problem arising at a Petrochemical Company. AlthoughGenetic Algorithms have been successfully used for similar problemsin the past, they always had to overcome the limitations of theclassical Genetic Algorithms paradigm in handling the conflict betweenobjectives and constraints. The approach taken here is to use an indir...
متن کامل